A review of lot streaming in a flow shop environment with makespan criteria
نویسندگان
چکیده
منابع مشابه
Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملLot Streaming in Hybrid Flow Shop Scheduling
Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical m...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملAn Integer Programming Formulation for the Lot Streaming Problem in a Job Shop Environment with Setups
This paper aims at solving the lot streaming problem in a job shop environment, where setup times are involved. The proposed integer programming formulation sufficiently describes the processing dynamics of individual sublots and enables the simultaneous determination of schedules on machines and sublot sizes. Small instances of job shop problems with consistent sublots can thus be optimally so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering and Management
سال: 2013
ISSN: 2013-0953,2013-8423
DOI: 10.3926/jiem.553